Metric Dichotomies

نویسنده

  • MANOR MENDEL
چکیده

These are notes from talks given at ICMS, Edinburgh, 4/2007 (“Geometry and Algorithms workshop”) and at Bernoulli Center, Lausanne 5/2007 (“Limits of graphs in group theory and computer science”). We survey the following type of dichotomies exhibited by certain classes X of finite metric spaces: For every host space H, either all metrics in X embed almost isometrically in H, or the distortion of embedding some metrics of X in H is unbounded. 1. Problem statement and motivation In these notes we examine dichotomy phenomena exhibited by certain classes X of finite metric spaces. When attempting to embed the metrics in X in any given host spaces H , either all of them embed almost isometrically, or there are some metrics in X which are very poorly embedded in H . To make this statement precise we define the distortion of metric embeddings. Given a mapping between metric spaces f : X → H , define the Lipschitz norm of f to be ‖f‖Lip = supx 6=y dH(f(x), f(y))/dX(x, y). The distortion of injective mapping f is defined as dist(f) = ‖f‖Lip · ‖f‖Lip, where f is defined on f(X). The “least distortion” in which X can be embedded in H is defined as cH(X) = inf{dist(f)| f : X → H}. This is a measure of the faithfulness possible when representing X using a subset of H . We formalize the discussion above as follows: Definition 1 (Qualitative Dichotomy). A class of finite metric spaces X has the qualitative dichotomy property if for any host space H , either • supX∈X cH(X) = 1; or • supX∈X cH(X) = ∞. Remark 1. As defined in Def. 1, the dichotomy is with respect to all metric spaces as hosts. It is possible to extend the definition to be with respect to all sets of metric spaces as hosts. That is, for a set of metric spaces H, define cH(X) = infH∈H cH(X), and replace the use of “cH(X)” in Def. 1 with “cH(X)”. This extension, however, is inconsequential and the two definitions are equivalent. This follows from the proof of Theorem 1.6 in [33], which implies that for any set of metric spaces H, there exists a metric Ĥ, such that for any finite metric space X , cĤ(X) = cH(X). A dichotomy theorem for X can be interpreted as a form of rigidity of X : Small deformations of all the spaces in X is impossible. We will also be interested in stronger dichotomies — of a quantitative nature — in which the unboundedness condition of the distortion is replaced with quantitative estimates on the rate in which it tends to infinity as a function of the size of the 1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Dichotomies for Metric Transforms

We show that for every nondecreasing concave function ω : [0,∞) → [0,∞) with ω(0) = 0, either every finite metric space embeds with distortion arbitrarily close to 1 into a metric space of the form (X,ω◦d) for some metric d on X, or there exists α = α(ω) > 0 and n0 = n0(ω) ∈ N such that for all n > n0, any embedding of {0, . . . , n} ⊆ R into a metric space of the form (X,ω ◦ d) incurs distorti...

متن کامل

Lecture Notes on Descriptive Set Theory

Metric spaces, Borel and analytic sets, Baire property and measurability, dichotomies, equivalence relations. Possible topics: determinacy, group actions, rigidity, turbulence.

متن کامل

On Metric Ramsey-type Dichotomies

The classical Ramsey theorem, states that every graph contains either a large clique or a large independent set. Here we investigate similar dichotomic phenomena in the context of finite metric spaces. Namely, we prove statements of the form ”Every finite metric space contains a large subspace that is nearly equilateral or far from being equilateral”. We consider two distinct interpretations fo...

متن کامل

ar X iv : 0 71 0 . 19 94 v 3 [ m at h . M G ] 1 0 A pr 2 00 8 Metric Dichotomies Manor Mendel

These are notes from talks given at ICMS, Edinburgh, 4/2007 (“Geometry and Algorithms workshop”) and at Bernoulli Center, Lausanne 5/2007 (“Limits of graphs in group theory and computer science”). We survey the following type of dichotomies exhibited by certain classes X of finite metric spaces: For every host space H, either all metrics in X embed almost isometrically in H, or the distortion o...

متن کامل

Ensembles of Balanced Nested Dichotomies for Multi-class Problems

A system of nested dichotomies is a hierarchical decomposition of a multi-class problem with c classes into c − 1 two-class problems and can be represented as a tree structure. Ensembles of randomlygenerated nested dichotomies have proven to be an effective approach to multi-class learning problems [1]. However, sampling trees by giving each tree equal probability means that the depth of a tree...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008